\line{\bf TRIVIA HUNT ANSWERS\hfil CS304, January 1989}
\bigskip
\font\eightrm=cmr8
\font\eightsl=cmsl8
\font\eighttt=cmtt8
\font\eightbf=cmbx8
\font\eighti=cmmi8
\font\sixi=cmmi6
\font\eightsy=cmsy8
\font\sixsy=cmsy6
\def\ans#1\!{\par\nobreak\medskip{\baselineskip=9pt
  \textfont0=\eightrm
  \textfont1=\eighti \scriptfont1=\sixi
  \textfont2=\eightsy \scriptfont2=\sixsy
 \let\tt=\eighttt\let\sl=\eightsl\let\bf=\eightbf\noindent\eightrm#1\par}}

\newcount\n
\def\\{\medbreak
\advance\n by 1 \item{\bf\number\n.\enspace}}
\def\=#1!{{\unskip\nobreak\hfil\penalty50\hskip2em\hbox{}\nobreak
 \hfil\sl#1\/\parfillskip=0pt\finalhyphendemerits=0\par}}

\\Who were the winners of the first Computer Science Trivia Hunt at
Stanford?\=5 points each!
What did they win?\=10 points!
\ans Tom\'as Feder, Barry Hayes, Tom Henzinger, and Alex Wang. (Reference:
CS1154, Appendix A.) They received certificates (printed with POX, a
historic computer typesetting system); they were also treated to
dinner at Late for the Train restaurant by Don and Jill Knuth on
10 March 1988. (Source: The team members.)\!

\\What computer scientist was born on 23 June 1912?\=15 points!
\ans Alan Mathison Turing. (Ref: Hodges, {\sl Alan Turing: The Enigma}, p.~5.)\!

\\In what house did Bill Walsh live when he was a Stanford coach?
Who lives there now?\kern-20pt\=15 points each!
\ans He was coach in 1977--1978.
According to the Stanford Faculty/Staff Directory, 1978, he
lived at 903 Cottrell Way, Stanford CA 94305; this is confirmed by the present
owner, Prof.~Thomas J. Hughes (chair of Mechanical Engineering).
[A plausible, but false, answer was also submitted:
 Inquirers at the Athletic Department were told
that Walsh lived in Menlo Park; and there is a Wm.~D Walsh living in Menlo
Park, listed continuously in local phone books since 1977.
However, {\sl that\/} Bill Walsh was a high school
football coach, not college or pro; the ``real'' Bill Walsh lives on
Valparaiso Avenue and has an unlisted phone number.
Incidentally, Walsh's announcement of his retirement was front
page news on Trivia Hunt day.]\!

\\What Stanford mathematics professor wrote one of the first papers ever
published about the Tower of Hanoi? What were the dates of his birth
and death? What is his relationship to Professor Floyd of our department?\=15
points each!
\ans Robert Edgar Allardice was co-author of ``La Tour d'Hano\"\i,'' {\sl
Proceedings of the Edinburgh Mathematical Society\/ \bf2} (1884), 50--53;
he was born 2 March 1862, came to Stanford in 1892, became emeritus in 1927,
and died on 6 May 1928. (Reference: Poggendorf's {\sl Handw\"orterbuch};
{\sl Proceedings of the Royal Society of Edinburgh\/ \bf48} (1927--1928), 209--210.)
Floyd lives at 895 Allardice Way.\!

\\What Stanford computer has its name displayed in stained glass?\=15 points!
\ans The SUMEX-AIM computer in Stanford Medical School. [People also found
`Solomon', `charity', `thing', `sheep', `how', and `why' on the windows in Stanford
Memorial Church; these are all names of computers at Stanford, according
to {\tt /etc/hosts}.]\!

\\What are the common names of {\it Formica rufa\/} Linn\ae us?\=10 points each!
\ans The fallow ant, according to Wheeler, {\sl Ants}, p.~8, or McCook, {\sl
The Agricultural Ant of Texas}, p.~152; also called hill ant, wood ant,
horse ant, and Waldameise (German), according to Donisthorpe, {\sl British
Ants}, p.~248; also red ant, Grizmek's {\sl Animal Life}, vol.~2.\!

\\Problem 4 in this year's CS304 is based on an article by Leslie Valiant.
Find all published papers that refer to his article and
give a full citation for every such
paper in the following style: L.~G. Valiant, ``Short monotone formulae for
the majority function,'' {\sl Journal of Algorithms\/ \bf5} (1984), 363--366.%
\=10 points each!
\ans The following can be found via {\sl Science Citation Index\/}: \
Joel Friedman, ``Constructing $O(n\log n)$ size monotone formulae for the
$k$th threshold function of $n$ boolean variables,'' {\sl SIAM Journal on
Computing\/ \bf15} (1986), 641--654. \
David S. Johnson, ``The NP-completeness column: An ongoing guide,''
{\sl Journal of Algorithms\/ \bf7} (1986), 289--305. \
Ravi B. Boppana, ``Threshold functions and bounded depth monotone circuits,''
{\sl Journal of Computer and System Sciences\/ \bf32} (1986), 222--229. \
S. A. Lozkin and A. A. Semenov, ``On construction of a complete system
of compression functions and on complexity of monotone realization of
threshold boolean functions,'' {\sl Lecture Notes in Computer Science\/
\bf278} [{\sl Fundamentals of Computation Theory}, proceedings of FCT87
in Kazan, USSR] (1987), 297--300.
And, there are two
other references in publications that (unfortunately) are not yet
covered by Science
Citation Index: Ravi B. Boppana, ``Amplification of probabilistic
boolean formulas,'' {\sl Proceedings of the 26th Annual Symposium on
Foundations of Computer Science\/} (1985), 20--29. (This one, unknown
to Knuth before the Trivia Hunt, is quite relevant to Problem 4.) \
M. Karchmer and A. Wigderson, ``Monotone circuits for connectivity require
super-logarithmic depth,'' {\sl Proceedings of the 20th Annual Symposium on
Theory of Computing\/} (1988), 539--550.\!

\\What identification numbers and dates are stamped on the following
Bench Marks of the U.\thinspace S. Coast and Geodetic Survey on Stanford's
campus? (1)~near a monumental horse; (2)~near a mosaic; (3)~near a potted
umbrella tree; (4)~near the 9th fairway.\=25 points each!
\ans Bench Marks are shown on the Palo Alto quadrangle of the U.\thinspace S.
Geological Survey maps in Branner Library. (1)~B151, 1933, at the base of
the statue of Sherwood, near the Old Red Barn on Fremont Road.
(2)~R875, 1954, embedded
in the NE corner of the Stanford Art Museum building. (3)~A151, 1933,
in concrete steps by the main entrance to the Carnegie Institution of
Washington Plant Biology building.
(4)~C151, 1933, on top of a granite rock outcropping
between the fairway and San Francisquito Creek, not far from the 9th tee
of Stanford Golf Course. Another one (D151, 1933) appears near the 7th fairway.
Still another (U110, 1932) is embedded in sandstone in the main quad, on a
corner of building 310 facing the rear of Memorial Church. Several of us
searched fruitlessly for yet another near the Children's Hospital.
According to the Geological Survey in Denver,
the Army Corps of Engineers came to Stanford in 1938 to determine the
horizontal locations of the bench marks whose vertical elevations had
been previously determined.\!

\\What artist made a painting of Jane Stanford's jewel collection, before
she sold it to help pay faculty salaries? What were the dates of his
birth and death?\=10 points each!
\ans Astley David Montague Cooper's painting entitled Mrs.~Stanford's Jewel
Collection hangs in the Stanford Museum, and it says he lived 1856--1924.
Further research via the Master Index of biographical reference books
leads to {\sl Artists of the American West}, where his death date is given
as 10 September 1924 in San Jose. The {\sl San Jose Mercury Herald\/} for
11 September 1924, p.~11, gives his birthdate as 23 December 1856.
According to A. Nagel, {\sl Iron Will: The life and letters of Jane
Stanford}, Mrs.~Stanford used money from the sale of the jewels for
an endowment whose income was ``to be used exclusively for the purchase
of books and other publications''; hence, the use of jewel money to pay
faculty salaries is apparently a myth, although there was definitely a period
when she contributed her own funds to help the faculty while her husband's
estate was tied up in court.\!

\\What three faculty members of Stanford's Computer Science Department
were born on the same day of the month (but not necessarily in the
same month)?\=30 points!
\ans The {\tt lookup} program on polya or the {\tt find} program
on SAIL gives Charles Bigelow on July 29,
David Cheriton on March 29, and Gene Golub on February 29; also
Consulting Professor Joe Halpern on May 29, and Visiting Professor John Sowa
on March 29. If we exclude professors of the latter type, there are no
two with the same birthday, although the ``birthday paradox'' says that
there probably should be. Another answer, using a different database:
John Hennessy, 22 Sep 1952; Yoav Shoham, 22 Jan 1956; Jeffrey Ullman, 22 Nov 1942.\!

\\What were the date and place of the first battle in the war between Mexico
and the United States?\=10 points each!
\ans 8 May 1846 at Palo Alto battlefield, Cameron County, Texas.
(First blood was drawn on April 24 when an American reconnoitering party
was attacked and captured; but the Palo Alto battle involved thousands of troops.)\!

\\Identify the author and source of the following quotations:\=10 points
for each author!\=15 points for each source!
\vskip1pt
\itemitem{a.}He teaches him to hick and to hack, which they'll do fast
enough of themselves\thinspace\dots---fie upon you.\par
\ans Shakespeare, {\sl Merry Wives of Windsor}; Act IV, Scene 1, line 60
(or other line numbers in other sources). The NeXt computer has this online.\!
\smallskip
\itemitem{b.}As a slow-witted human being I have a very small head and I~had better
learn to live with it and to respect my limitations and give them full credit,
rather than try to ignore them, for the latter vain effort will be punished
by failure.
\ans Dijkstra, in {\sl Structured Programming}, Academic Press, 1972, p~3.\!
\smallskip
\itemitem{c.}My thesis is that high-performance systolic arrays can be used
effectively by providing to the user a simple machine abstraction supported
by optimizing compilation techniques. The user sees the systolic array as
an array of sequential processors communicating asynchronously.
\ans Monica Sin-Ling Lam,
{\sl A Systolic Array Optimizing Compiler\/} (thesis), CMU-CS-87-187, p.~2.\!

\\Obtain xerographic copies of the title pages of the journal articles
in which (1)~Binet published ``Binet's formula'' for Fibonacci numbers;
(2)~Chebyshev published ``Chebyshev's inequality''; (3)~Vandermonde
published ``Vandermonde's convolution''.\=15 points each!
\ans (1) J. Binet, ``M\'emoire sur l'int\'egration des \'equations lin\'eaires
aux diff\'e\-ren\-ces finies, d'un ordre quelconque, \`a coefficients
variables,'' {\sl Comptes Rendus hebdomadaires des s\'eances de l'Acad\'emie des
Sciences\/} (Paris) {\bf17} (1843), 559--567. \
(2)~P.-L. Tch\'ebyshef, ``Des valeurs moyennes,'' {\sl Journal de Math\'matiques
pures et appliqu\'ees}, series 2, {\bf12} (1867), 177--184; that's a
translation of the Russian original, which was ``O srednikh velichinakh,''
{\sl Matematicheski\u\i\
Sbornik'\/ \bf2} (1867), 1--9. Stanford's library doesn't own that
journal, but copies exist at Berkeley, Brown, Columbia, Duke, Illinois,
Penn, and Yale, as well as the Library of Congress, according to the
National Union Catalog. With a friend at one of those places it would
have been possible to fax the page (but nobody did). Karl Pearson, in
{\sl Biometrika\/ \bf12}, p.~285, said that he couldn't trace the Russian original
``at all.''  The French version was reprinted
in Chebyshev's {\sl \OE uvres}, volume~1, 685--694; the Russian original was
reprinted in his {\sl Polnoe Sobranie Sochineni\u\i}, volume~2, 431--437 (and
Stanford does own that). \
(3)~A. Vandermonde, ``M\'emoire sur des irrationnelles de diff\'erens ordres
avec une application au cercle,''
{\sl Histoire de l'Acad\'emie Royale des Sciences\/} (1772), part~1, 71--72;
{\sl M\'emoires de Math\'ematique et de Physique, Tir\'es des
Registres de l'Acad\'emie Royale des Sciences\/} (1772), 489--498.\!

\\What are the next two numbers in the sequence 1, 1, 2, 5, 12, 35, 108, 369, \dots?
Who first computed them? Who first computed the values 108 and 369?\=10 points each!
\ans Sloane's {\sl Handbook of Integer Sequences\/} identifies this as sequence
\#561, the number $P_n$ of polyominoes made from $n$~squares (possibly enclosing
one or more blank squares). Sloane refers to a paper by W.\thinspace F. Lunnon,
``Counting polyominoes,'' {\sl Computers in Number Theory\/}
(Academic Press, 1971), 347--372; Lunnon discusses the history on pp.~356--357.
Chasing down his references, we find that R. Read computed $P_9=1285$ in
``Contributions to the cell growth problem,''
 {\sl Canadian Journal of Mathematics\/ \bf14} (1962), 1--20, where
an incorrect value $P_{10}=4466$ is stated; the correct value $P_{10}=4655$
must therefore have been computed first by T.\thinspace R. Parkin, L.\thinspace J.
Lander, and D.\thinspace R. Parkin in unpublished work announced at the
SIAM fall meeting in 1967 (according to Lunnon). Going back from Read, we find
an article by Frank Harary, ``Unsolved problems in the enumeration of graphs,''
{\sl Magyar Tudom\'anyos Akad\'emia, Matematikai Kutat\'o Int\'ezet\'enek,
K\"ozlem\'enyei\/ \bf5} (1960), 63--95, where he states that Golomb's
incorrect claim $P_7=109$ was corrected by Stein, Walden, and Williamson,
who also computed $P_8$. They did their calculations on the MANIAC~II at
Los Alamos, according to Read. Incidentally, the calculation of $P_n$ seems to
be fraught with difficulty,
since Lunnon claims that Parkin et al.\ had $P_{15}$ wrong.\!

\\Who coined the term `Artificial Intelligence'? What was research in that field
called previously?\=15 points each!
\ans John McCarthy chose it late in 1955, and used it in his grant application to
the Rockefeller Foundation for the 1956 Dartmouth Summer Research Project
on Artificial Intelligence. Minsky drafted his essay ``Steps toward artificial
intelligence'' after that key conference. Previously the subject had been
called `automata studies'; see the book {\sl Automata Studies}, edited
by McCarthy and Shannon, in which W. Ross Ashby writes about `machines with
``synthetic'' intellectual powers'. Another term, proposed by Newell and
Simon, was `complex information processing' (RAND report P-850); see their
book {\sl Human Problem Solving}, 883--884. McCarthy's recollections are
documented in {\sl Machines who think\/} by Pamela McCorduck, p.~96.\!

\\Who wrote the report STAN-CS-88-1233? What is that author's favorite color?\=10
points each!
\ans Ken Ross, our friendly TA, likes sky blue best (finger {\tt kar @ polya}).\!

\\Suppose the words of English were alphabetized from right to left
instead of from left to right, so that all words ending in {\tt a} would
come first, then all words ending in {\tt b}, etc. What would be the
last word in the dictionary? What words would immediately precede and
follow {\tt trivia}? Note: Abbreviations, proper nouns, and hyphenated words
do not count. If your words are not commonly known,
you must state their meaning and give the name of a standard English
dictionary that lists them.\=15 points each!
\ans According to the `Normal and reversed word list\dots' in the Math/CS library
(PE1680 N6), which is based on Webster's Second Unabridged and other
dictionaries, the last word is {\tt bruzz}, a wheelwright's corner chisel.
That dictionary contains the sequence
{\tt parathyroprivia}, {\tt trivia}, {\tt Opiconsivia}, {\tt plenalvia},
{\tt salvia}. The proper name {\tt Opiconsivia} doesn't count; according to
Webster's Second, {\tt parathyroprivia} is a disease, a deficiency of hormones
from the parathyroid glands; according to Chambers's Technical Dictionary,
{\tt plenalvia} is ``impaction of the rumen of cattle''; and {\tt salvia}
is a genus of herbs that includes sage. Of these words, only {\tt salvia}
can be found in Webster's Third Unabridged. But there are better answers:
The Oxford English Dictionary contains {\tt vuzz}, a southern variant
of furze (an evergreen shrub); the Official Scrabble Players' Dictionary
mentions {\tt lixivia}, the plural of lixivium---solutions obtained
by lixiviation (also in OED).\!

\\Identify the computer language in which each of the following program
fragments is written:\=10 points each!
\vskip-6pt
\def\\#1{\hbox{\it#1\/\kern.05em}} % italic type for identifiers
\def\?{\hfil\break}
\smallskip\itemitem{a.}
\font\sltt=cmsltt10 \font\sytt=cmttsy10 \font\tex=cmtex10 \font\manfnt=manfnt
{\tt +/0=100|{\kern-1pt\sltt V\kern1pt}{\sytt\char2}{\kern-1pt\sltt V\kern1pt}>0}
\ans APL (from Gilman and Rose, {\sl APL}, exercise 8H).\!
\smallbreak\itemitem{b.}
{\bf procedure} Innerproduct$(a,b)\,$Order:$(k,p)\,$Result:$(y)$; {\bf value} $k$;
{\bf integer} $k,p$; {\bf real} $y,a,b$;\?
{\bf begin real} $s$; $s:=0$; {\bf for} $p:=1$ {\bf step} 1 {\bf until} $k$
{\bf do} $s:=s+a\times b$; $y:=s$ {\bf end} Innerproduct
\ans Algol 60 (from the original report, {\sl CACM\/ \bf3} (1960), 311);
reprinted in Horowitz, {\sl Programming languages: A grand tour}.\!
\smallbreak\itemitem{c.}
{\tex\frenchspacing
 stacks\char'30(Array new:3)collect:[:each|OrderedCollection new].\?
(height to: 1 by: -1)do:[:each|(stacks at: 1)addFirst:\?
\null\ \ (Character value:(\$A asciiValue) + each - 1)].}
\ans Smalltalk (from Kaehler and Patterson, {\sl A Taste of Smalltalk}, p.~45).\!
\smallbreak\itemitem{d.}
\\{linkage} {\bf class} \\{link};\?
{\bf begin procedure} \\{out};\?
{\bf if} $\\{suc}\mathrel{{=}/{=}}\\{none}$ {\bf then}
{\bf begin} $\\{suc}.\\{pred}\mathrel{{:}-}\\{pred}$;
$\\{pred}.\\{suc}\mathrel{{:}-}\\{suc}$;
$\\{suc}\mathrel{{:}-}\\{pred}\mathrel{{:}-}\\{none}$ {\bf end} \dots {\bf end}
\ans SIMULA 67 (from Helmut Rolfing, {\sl SIMULA}, p.~165).\!
\smallbreak\itemitem{e.}
{\tt 10100800\?00E88C03\?00000000\?00000004}
\ans The ant language of Problem 5. (It also disassembles into valid but uninspiring
68000 code, but it is definitely not VAX code.)\!
\smallbreak\itemitem{f.}
{\tt IF DAY EXCEEDS 31 THEN SUBTRACT 31 FROM DAY;\?
MOVE "APRIL" TO MONTH; OTHERWISE MOVE "MARCH" TO MONTH.}
\ans COBOL (from {\sl CACM\/ \bf5} (1962), 210).\!
\smallbreak\itemitem{g.}
{\tex Procedure Mguvar (x,y)\?
\null\ \ \ \ Begin Includes(x,y) ==> Return(False),\?
\null\ \ \ \ \ \ \ \ \ \ Return([x/y])\?
\null\ \ \ \ End}
\ans Demonstration language in Genesereth and Nilsson, {\sl Logical Foundations
of Artificial Intelligence}, p.~68.\!
\smallbreak\itemitem{h.}
$\\{top}\,y_2=\\{top}\,y3=.45\,\\{bot}\,y_0$; $z_2=\\{whatever}[z_1,z_{4r}]$;
\ans {\manfnt METAFONT} (from Knuth's {\manfnt89:;<=>:}\kern1pt{\sl book}, p.~164)\!
\smallbreak\itemitem{i.}
\par\vskip-\baselineskip\halign{\hskip40pt\tt#\hfill\quad&&\tt#\hfill\quad\cr
R2&&J60\cr &70&J8\cr &40&H0\cr &40&H0\cr &&R2\cr &12&H0\cr &&J65&J68\cr}
\ans IPL-V (from Sammet, {\sl Programming Languages}, p.~392).\!
\smallbreak\itemitem{j.}
{\tt\frenchspacing : SQUARE DUP *;\?
: CUBE DUP SQUARE *;\?
: FOURTH DUP CUBE *;}
\ans FORTH (from Churlian, {\sl Beginning FORTH}, p37); note also\qquad
{\tt\frenchspacing : BETTERFOURTH SQUARE SQUARE;}\!
\smallbreak\itemitem{k.}
{\tt F\"ur j=1(1)n :\?
\tex h\lower2pt\hbox{j-1}+(a\lower2pt\hbox{ij}{\sytt\char2}b\lower2pt\hbox{jk})%
\rlap{==}\kern.25em>\kern.25em h\lower2pt\hbox{j}\?
Ende Index j}
\ans From Heinz Rutishauser, {\sl Automatische Rechenplanfertigung\dots} (1952),
 p.~26.\!
\smallbreak\itemitem{l.}
{\tt picnic(Day) :- holiday(Day,july\_4), !.\?
picnic(Day) :- weather(Day,fair), weekend(Day).}
\ans Prolog (from Jean Rogers, {\sl A Prolog Primer}, p.~118).\!
\smallbreak\itemitem{m.}
\\{Node} = {\bf pointer to} \\{Object};\?
\\{Object} = {\bf record} $\\{key}, x, y$: {\bf integer};
 $\\{left}, \\{right}$: \\{Node} {\bf end};\?
\\{Rectangle} = {\bf pointer to} \\{RectObject};\?
\\{RectObject} = {\bf record}(\\{Object}) $w,h$: {\bf real end};\?
\dots\ {\bf if\/} $p$ {\bf is} \\{Rectangle} {\bf then}
$\\{area}:=p(\\{Rectangle}).w\ast p(\\{Rectangle}).h$; \dots
\ans Oberon (see N. Wirth, ``From Modulo to Oberon,'' {\sl Software---Practice
\& Experience\/ \bf18} (1988), 66--77). But in Oberon one must type the
reserved words all in uppercase letters.\!
\smallbreak\itemitem{n.}
{\chardef\{=`\{ \chardef\}=`\}
{\tex/increase-x\{xpos radius add /xpos exch def\}def\?
/doCircle\{xpos ypos radius 0 360 circ stroke\}def\?
\{xpos pagewidth le \{doCircle increase-x\}\{exit\}ifelse\}loop}}
\ans PostScript (from Adobe Systems, {\sl PostScript Language Tutorial
and Cookbook}, pp.~69--70).\!
\smallbreak\itemitem{o.}
\par\vskip-\baselineskip
\halign{\hskip40pt\hfill$#\null$&#\hfil\cr
\\{testr}[x,p,f,u]\gets&{\bf if\/} $p[x]$ {\bf then} $f[x]$ {\bf else}\cr
&{\bf if\/} $\\{atom}[x]$ {\bf then} $u[\,]$ {\bf else}\cr
&$\\{testr}[\\{cdr}[x],p,f,\lambda{:}\\{testr}[\\{car}[x],p,f,u]]$.\cr}
\ans McCarthy's publication language for LISP (from Wexelblatt, {\sl History
of Programming Languages}, p.~180); it is properly called M-language
(see p.~177 of that book).\!
\vfill\eject
\noindent {\bf Scores:}

\def\tbox#1{\omit\hidewidth\quad\vbox{\halign{##\hfil\cr#1\crcr}}\hidewidth}
\vbox{\tabskip=0pt plus 100pt
\halign to\hsize{\hfil#\quad&&\hfil#\cr
Problem&
\tbox{Rajeev Alur\cr Tom Henzinger*\cr Sherry Listgarden\cr Alex Wang*}&
\tbox{Adam G\cr Urs H\cr Sanjoy M\cr Daniel S}&
\tbox{Eddie C\cr Dinesh K\cr Patrick L\cr Michael Y}&
\tbox{Arul M\cr Steven P\cr Alon L\cr Rob K\cr Roland C}\cr
\noalign{\smallskip}
1&	30&	30&	30&	18\cr
2&	15&	15&	15&	15\cr
3&	30&	10&	30&	30\cr
4&	60&	20&	20&	60\cr
5&	35&	15&	20&	10\cr
6&	30&	10&	50&	10\cr
7&	43&	30&	10&	10\cr
8&	80&	120&	25&	75\cr
9&	35&	26&	35&	16\cr
10&	50&	30&	40&	30\cr
11&	25&	25&	25&	25\cr
12&	75&	50&	0&	0\cr
13&	40&	40&	30&	20\cr
14&	30&	35&	10&	20\cr
15&	30&	15&	30&	20\cr
16&	20&	1&	20&	20\cr
17&	30&	40&	40&	45\cr
18&	62&	72&	22&	51\cr
\noalign{\smallskip}
Totals&	720\rlap{*}&	584\rlap{\dag}&	452&	475\cr
}}

\bigskip
\noindent*Successfully defending their championship performance of 1987\par
\noindent\dag The winning score from this year's CS304 students\par

\bye